On Minkowski sums of simplices
نویسندگان
چکیده
We investigate the structure of the Minkowski sum of standard simplices in R. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope. 2000 MSC: 52B05, 52B11, 05C07.
منابع مشابه
On a Special Class of Hyper-Permutahedra
Minkowski sums of simplices in Rn form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices ∆k−1 in Rn where k and n are fixed, their flags and some of their face lattice structure. In particular, we derive a closed formula for their exponential generating flag function. These polytopes are simple, include both ...
متن کاملOn f-vectors of Minkowski additions of convex polytopes
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of face lattice of the sum in terms of the face lattice of a given perfectly centered polytope. Exact f...
متن کاملf-Vectors of Minkowski Additions of Convex Polytopes
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes called perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of faces of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face coun...
متن کاملProdsimplicial-Neighborly Polytopes
Simultaneously generalizing both neighborly and neighborly cubical polytopes, we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to that of a product of r simplices. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal & Ziegler’s “projecting deformed products” construction to products of arbitrary simple polytopes....
متن کاملMarked tubes and the graph multiplihedron
Given a graph G , we construct a convex polytope whose face poset is based on marked subgraphs of G . Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of the multiplihedron, but features of this polytope appear in works related to quilted disks, bordered Riemann surfaces and operadic structures. Certain exampl...
متن کامل